Approximations for Steiner trees with minimum number of Steiner points
نویسندگان
چکیده
منابع مشابه
Approximations for Steiner Trees with Minimum Number of Steiner Points
Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steine...
متن کاملApproximating Steiner Trees and Forests with Minimum Number of Steiner Points
Let R be a finite set of terminals in a metric space (M,d). We consider finding a minimum size set S ⊆ M of additional points such that the unit-disc graph G[R ∪ S] of R ∪ S satisfies some connectivity properties. In the Steiner Tree with Minimum Number of Steiner Points (ST-MSP) problem G[R ∪ S] should be connected. In the more general Steiner Forest with Minimum Number of Steiner Points (SF-M...
متن کاملA note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approximating the Steiner tree with minimum number of Steiner points and bounded edge-lengths. The approximation factor of the heuristic is shown to be one less than the MST number of the underlying space, de ned as the maximum possible degree of a minimum-degree MST spanning points from the space. In ...
متن کاملApproximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
We consider low connectivity variants of the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set R of terminals in a metric space (M,d), a subset B ⊆ R of “unstable” terminals, and connectivity requirements {ruv : u, v ∈ R}, find a minimum size set S ⊆ M of additional points such that the unit-disc graph of R∪S contains ruv pairwise internally edge-disj...
متن کاملApproximating Survivable Networks with Minimum Number of Steiner Points
Given a graph H = (U,E) and connectivity requirements r = {r(u, v) : u, v ∈ R ⊆ U}, we say that H satisfies r if it contains r(u, v) pairwise internally-disjoint uv-paths for all u, v ∈ R. We consider the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set V of points in a normed space (M, ‖·‖) and connectivity requirements, find a minimum size set S ⊂ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00182-1